Computing skeletons in three dimensions
نویسندگان
چکیده
Skeletonization will probably become as valuable a tool for shape analysis in 3D, as it is in 2D. We present a topology preserving 3D skeletonization method which computes both surface and curve skeletons whose voxels are labelled with the D6 distance to the original background. The surface skeleton preserves all shape information, so (close to) complete recovery of the object is possible. The curve skeleton preserves the general geometry of the object. No complex computations, large sets of masks, or extra memory are used, which make implementations e$cient. Resulting skeletons for geometric objects in a number of 2 Mbyte images are shown as examples. ( 1999 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
منابع مشابه
Geodesic grassfire for computing mixed-dimensional skeletons
Skeleton descriptors are commonly used to represent, understand and process shapes. While existing methods produce skeletons at a fixed dimension, such as surface or curve skeletons for a 3D object, often times objects are better described using skeleton geometry at a mixture of dimensions. In this paper we present a novel algorithm for computing mixed-dimensional skeletons. Our method is guide...
متن کاملA simple and robust thinning algorithm on cell complexes
Thinning is a commonly used approach for computing skeleton descriptors. Traditional thinning algorithms often have a simple, iterative structure, yet producing skeletons that are overly sensitive to boundary perturbations. We present a novel thinning algorithm, operating on objects represented as cell complexes, that preserves the simplicity of typical thinning algorithms but generates skeleto...
متن کاملParallel Programming with Tree Skeletons
Parallel computing is an essential technique to deal with large scaled problems. In recent years, while hardware for parallel computing is getting widely available, developing software for parallel computing remains as a hard task for many programmers. The main difficulties are caused by the communication, synchronization, and data distribution required in parallel programs. This thesis studies...
متن کاملSkeletal Representations and Applications
When representing a solid object there are alternatives to the use of traditional explicit (surface meshes) or implicit (zero crossing of implicit functions) methods. Skeletal representations encode shape information in a mixed fashion: they are composed of a set of explicit primitives, yet they are able to efficiently encode the shape’s volume as well as its topology. I will discuss, in two di...
متن کاملManagement of distributed dynamic data with algorithmic skeletons
Algorithmic skeletons are polymorphic higher-order functions that represent common parallelization patterns. They can be used as the building blocks of parallel applications by integrating them into a sequential language. In this paper, we consider the design and implementation of skeletons for the management of distributed dynamic data. Such skeletons are used by grid-managers of numerical sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 32 شماره
صفحات -
تاریخ انتشار 1999